On Memory Management of Tree-bitmap Algorithm for IP Address Lookup
نویسندگان
چکیده
A Memory Management Unit (MMU) is adopted in the implementation of the Tree-bitmap algorithm for IP address lookup, and its memory allocation policy is vital to the performance of incremental update of Routing Information Base (RIB). Using the RIB database of active routers, a Tree-bitmap based IP address lookup table is constructed, and the memory allocation pattern of the incremental update scheme is analyzed. Based on the analysis, a reference free memory arrangement model is proposed. This model serves as a practical guide for the implementing the MMU for an incremental update version of the Tree-bitmap algorithm. Experimental results show that the proposed model is of good quality and its steady distribution can be applied to most RIBs in today’s routers, and can be used to reduce the amount of memory copying by as much as 85%.
منابع مشابه
A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملScalable IP lookup for Internet routers
Internet protocol (IP) address lookup is a central processing function of Internet routers. While a wide range of solutions to this problem have been devised, very few simultaneously achieve high lookup rates, good update performance, high memory efficiency, and low hardware cost. High performance solutions using content addressable memory devices are a popular but high-cost solution, particula...
متن کاملScalable IP Lookup for Programmable Routers
Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services imposes new demands for flexibility and programmability. IP address lookup has become a significant performance bottleneck for the highest performance routers. Amid the vast array of academic and commercial solutions to the prob...
متن کاملExpediating IP lookups with reduced power via TBM and SST supernode caching
0140-3664/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.comcom.2009.10.006 * Corresponding author. E-mail addresses: [email protected] (Y. Zhang) [email protected] (W. Lu), [email protected] (L. Duan), s In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based scheme, we imp...
متن کامل